A primal - dual schema based approximation algorithm for the
نویسندگان
چکیده
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint paths. The edge version is by now well understood from the viewpoint of approximation algorithms, but very little is known about the vertex version. Our problem, which is interesting in its own right, should shed light on the latter.
منابع مشابه
On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique
We discuss two approximation paradigms that were used to construct many approximation algorithms during the last two decades, the primal-dual schema and the local ratio technique. Recently, primal-dual algorithms were devised by first constructing a local ratio algorithm, and then transforming it into a primal-dual algorithm. This was done in the case of the 2-approximation algorithms for the f...
متن کاملUsing Combinatorial and LP-based Methods to Design Approximation Algorithms
Our goal in this proposal is to explore the connection between the local ratio technique and linear programming. We believe that a better understanding of this connection will strengthen and extend the local ratio technique and will enable us to apply the technique to a wide variety of problems. Specifically, we intend to improve the best performance guarantee and/or running time of approximati...
متن کاملApproximation Algorithms Based on the Primal-Dual Method
The primal-dual method (or primal-dual schema) is another means of solving linear programs. The basic idea of this method is to start from a feasible solution y to the dual program, then attempt to find a feasible solution x to the primal program that satisfies the complementary slackness conditions. If such an x cannot be found, it turns out that we can find a better y in terms of its objectiv...
متن کاملApproximation Algorithms Based on the Primal-Dual Method
The primal-dual method (or primal-dual schema) is another means of solving linear programs. The basic idea of this method is to start from a feasible solution y to the dual program, then attempt to find a feasible solution x to the primal program that satisfies the complementary slackness conditions. If such an x cannot be found, it turns out that we can find a better y in terms of its objectiv...
متن کاملPrimal-Dual Schema for Capacitated Covering Problems
Primal-dual algorithms have played an integral role in recent developments in approximation algorithms, and yet there has been little work on these algorithms in the context of LP relaxations that have been strengthened by the addition of more sophisticated valid inequalities. We introduce primal-dual schema based on the LP relaxations devised by Carr, Fleischer, Leung & Phillips for the minimu...
متن کاملPrimal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover problem and its generalizations. Our algorithms use randomization, and our randomized voting lemmas may be of independent interest. Fast parallel approximation algorithms were known before for set cover, though not for the...
متن کامل